Integer programs and valid inequalities for planning problems
Identifieur interne : 009B53 ( Main/Exploration ); précédent : 009B52; suivant : 009B54Integer programs and valid inequalities for planning problems
Auteurs : Alexander Bockmayr ; Yannis DimopoulosSource :
English descriptors
Abstract
Part of the recent work in AI planning is concerned with the development of algorithms that regard planning as a combinatorial search problem. The underlying representation language is basically propositional logic. While this is adequate for many domains, it is not clear if it remains so for problems that involve numerical constraints, or optimization of complex objective functions. Moreover, the propositional representation imposes restrictions on the domain knowledge that can be utilized by these approaches. In order to address these issues, we propose moving to the more expressive language of Integer Programming (IP). We show how capacity constraints can be easily encoded into linear 0-1 inequalities and how rich forms of domain knowledge can be compactly represented and computationally exploited by IP solvers. Then we introduce a novel heuristic search method based on the linear programming relaxation. Finally, we present the results of our experiments with a classical relaxation-based IP solver and a logic-based 0-1 optimizer.
Affiliations:
Links toward previous steps (curation, corpus...)
- to stream Crin, to step Corpus: 002B79
- to stream Crin, to step Curation: 002B79
- to stream Crin, to step Checkpoint: 001A99
- to stream Main, to step Merge: 00A133
- to stream Main, to step Curation: 009B53
Le document en format XML
<record><TEI><teiHeader><fileDesc><titleStmt><title xml:lang="en" wicri:score="253">Integer programs and valid inequalities for planning problems</title></titleStmt><publicationStmt><idno type="RBID">CRIN:bockmayr00a</idno><date when="2000" year="2000">2000</date><idno type="wicri:Area/Crin/Corpus">002B79</idno><idno type="wicri:Area/Crin/Curation">002B79</idno><idno type="wicri:explorRef" wicri:stream="Crin" wicri:step="Curation">002B79</idno><idno type="wicri:Area/Crin/Checkpoint">001A99</idno><idno type="wicri:explorRef" wicri:stream="Crin" wicri:step="Checkpoint">001A99</idno><idno type="wicri:Area/Main/Merge">00A133</idno><idno type="wicri:Area/Main/Curation">009B53</idno><idno type="wicri:Area/Main/Exploration">009B53</idno></publicationStmt><sourceDesc><biblStruct><analytic><title xml:lang="en">Integer programs and valid inequalities for planning problems</title><author><name sortKey="Bockmayr, Alexander" sort="Bockmayr, Alexander" uniqKey="Bockmayr A" first="Alexander" last="Bockmayr">Alexander Bockmayr</name></author><author><name sortKey="Dimopoulos, Yannis" sort="Dimopoulos, Yannis" uniqKey="Dimopoulos Y" first="Yannis" last="Dimopoulos">Yannis Dimopoulos</name></author></analytic></biblStruct></sourceDesc></fileDesc><profileDesc><textClass><keywords scheme="KwdEn" xml:lang="en"><term>artificial intelligence</term><term>integer programming</term><term>planning</term></keywords></textClass></profileDesc></teiHeader><front><div type="abstract" xml:lang="en" wicri:score="4172">Part of the recent work in AI planning is concerned with the development of algorithms that regard planning as a combinatorial search problem. The underlying representation language is basically propositional logic. While this is adequate for many domains, it is not clear if it remains so for problems that involve numerical constraints, or optimization of complex objective functions. Moreover, the propositional representation imposes restrictions on the domain knowledge that can be utilized by these approaches. In order to address these issues, we propose moving to the more expressive language of Integer Programming (IP). We show how capacity constraints can be easily encoded into linear 0-1 inequalities and how rich forms of domain knowledge can be compactly represented and computationally exploited by IP solvers. Then we introduce a novel heuristic search method based on the linear programming relaxation. Finally, we present the results of our experiments with a classical relaxation-based IP solver and a logic-based 0-1 optimizer.</div></front></TEI><affiliations><list></list><tree><noCountry><name sortKey="Bockmayr, Alexander" sort="Bockmayr, Alexander" uniqKey="Bockmayr A" first="Alexander" last="Bockmayr">Alexander Bockmayr</name><name sortKey="Dimopoulos, Yannis" sort="Dimopoulos, Yannis" uniqKey="Dimopoulos Y" first="Yannis" last="Dimopoulos">Yannis Dimopoulos</name></noCountry></tree></affiliations></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/Main/Exploration
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 009B53 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Main/Exploration/biblio.hfd -nk 009B53 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Lorraine
|area= InforLorV4
|flux= Main
|étape= Exploration
|type= RBID
|clé= CRIN:bockmayr00a
|texte= Integer programs and valid inequalities for planning problems
}}
| This area was generated with Dilib version V0.6.33. |  |